منابع مشابه
Comment Flow: Visualizing Communication along Network Path
Social networks are abstract organizational structures that help us understand the relationships among a group of interconnected individuals. Much recent research has focused on understanding the structure of these networks. Yet the network itself is a conceptual topology. The key is the activity that flows along the network paths: the support offered, the information given, the gossip exchange...
متن کاملMulti-agent Path Planning and Network Flow
This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the later, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, to multi-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invaria...
متن کاملMulti-path multi-flow entanglement routing in a quantum network
Mihir Pant, 2, ∗ Hari Krovi, Don Towsley, Leandros Tassiulas, Liang Jiang, Prithwish Basu, Dirk Englund, and Saikat Guha Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA Quantum Information Processing group, Raytheon BBN Technologies, 10 Moulton Street, Cambridge, MA College of Information and Computer Sciences, University of Massachusetts, Amherst, MA School of Eng...
متن کاملLine planning, path constrained network flow and inapproximability
We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed maximally along all possible lines? The essence of this problem is the Path Constrained Network Flow (PCN) problem. We explore the complexity of this problem and its dual. In particular we show for the primal that it is as hard ...
متن کاملNeural Network Matrix Factorization
Data often comes in the form of an array or matrix. Matrix factorization techniques attempt to recover missing or corrupted entries by assuming that the matrix can be written as the product of two low-rank matrices. In other words, matrix factorization approximates the entries of the matrix by a simple, fixed function—namely, the inner product—acting on the latent feature vectors for the corres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/21626-4929